Separating the Communication Complexities of MOD m and MOD p Circuits
نویسندگان
چکیده
منابع مشابه
Separating the Communication Complexities of MOD m and MOD p Circuits
We prove in this paper that it is much harder to evaluate depth–2, size–N circuits with MOD m gates than with MOD p gates by k–party communication protocols: we show a k–party protocol which communicates O(1) bits to evaluate circuits with MOD p gates, while evaluating circuits with MOD m gates needs Ω(N) bits, where p denotes a prime, and m a composite, non-prime power number. As a corollary, ...
متن کاملLower Bounds for (MOD p - MOD m) Circuits
Modular gates are known to be immune for the random restriction techniques of Ajtai Ajt83], Furst, Saxe, Sipser FSS84], Yao Yao85] and H astad H as86]. We demonstrate here a random clustering technique which overcomes this diiculty and is capable to prove generalizations of several known modular circuit lower bounds of Barrington, Straubing, Th erien BST90], Krause and Pudll ak KP94], and other...
متن کاملA Degree-Decreasing Lemma for (MOD q - MOD p) Circuits
Consider a (MODq;MODp) circuit, where the inputs of the bottom MODp gates are degree-d polynomials with integer coefficients of the input variables (p, q are different primes). Using our main tool — the Degree Decreasing Lemma — we show that this circuit can be converted to a (MODq;MODp) circuit with linear polynomials on the input-level with the price of increasing the size of the circuit. Thi...
متن کاملRestricted Two-Variable FO+MOD Sentences, Circuits and Communication Complexity
We obtain a logical characterization of an important class of regular languages, denoted DO, and of its most important subclasses in terms of two-variable sentences with ordinary and modular quantifiers but in which all modular quantifiers lie outside the scope of ordinary quantifiers. The result stems from a new decomposition of the variety of monoids DO in terms of iterated block products. Th...
متن کاملThe Fibonacci Sequence Mod m
We know that ( ) mod n F p forms a periodic sequence (vide Theorem 4). Let ( ) h p denote the length of the sequence. Let p be a prime such that: { } ( ) 2,3 mod 5 p ≡ a sufficient and necessary condition to ensure that ( ) 2 2 h p p + . We shall denote this group 1 G F . Let { } 1, 2 , , k D d d d = be the non-empty set of k divisors of 2 2 p + . Then for ( ) [ ] 1 min G i F h p d = such that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1995
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1069